Learnable Spectral Wavelets on Dynamic Graphs to Capture Global Interactions

نویسندگان

چکیده

Learning on evolving(dynamic) graphs has caught the attention of researchers as static methods exhibit limited performance in this setting. The existing for dynamic learn spatial features by local neighborhood aggregation, which essentially only captures low pass signals and interactions. In work, we go beyond current approaches to incorporate global effectively learning representations a dynamically evolving graph. We propose do so capturing spectrum Since graph would not consider history evolution evolves with time, an approach wavelets capture spectra. Further, framework that integrates captured spectra form these learnable into incorporating Experiments eight standard datasets show our method significantly outperforms related various tasks graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wavelets on Graphs via Spectral Graph Theory

We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the graph analogue of the Fourier domain, namely the spectral decomposition of the discrete graph Laplacian L. Given a wavelet generating kernel g and a scale parameter t, we define the scaled wavelet operator T...

متن کامل

SIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM

Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$  and  $A(G)$ the adjacency matrix of $G$. The  signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of  graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...

متن کامل

Spectral Co-Clustering for Dynamic Bipartite Graphs

A common task in many domains with a temporal aspect involves identifying and tracking clusters over time. Often dynamic data will have a feature-based representation. In some cases, a direct mapping will exist for both objects and features over time. But in many scenarios, smaller subsets of objects or features alone will persist across successive time periods. To address this issue, we propos...

متن کامل

on the skew spectral moments of graphs

let $g$ be a simple graph‎, ‎and $g^{sigma}$‎ ‎be an oriented graph of $g$ with the orientation ‎$sigma$ and skew-adjacency matrix $s(g^{sigma})$‎. ‎the $k-$th skew spectral‎ ‎moment of $g^{sigma}$‎, ‎denoted by‎ ‎$t_k(g^{sigma})$‎, ‎is defined as $sum_{i=1}^{n}( ‎‎‎lambda_{i})^{k}$‎, ‎where $lambda_{1}‎, ‎lambda_{2},cdots‎, ‎lambda_{n}$ are the eigenvalues of $g^{sigma}$‎. ‎suppose‎ ‎$g^{sigma...

متن کامل

An Efficiently Learnable Constructive Method for Graphs

Graph data structures allow us to model complex entities in a natural and expressive way. In the literature, several types of discriminative systems that can deal with graphs in input are known (e.g. recursive neural networks, graph kernels, etc), however, there are few generative or constructive approaches that can output graphs belonging with high probability to a desired distribution or clas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i6.25831